Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works

Minimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem

  This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...

Single Machine Scheduling to Minimize Total Weighted Late Work

Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time

1Laboratory of Algorithms and Technologies for Networks Analysis National Research University Higher School of Economics 136 Rodionova street, Niznhy Novgorod 603093, Russia 2Department of Industrial and Systems Engineering, University of Florida 303 Weil Hall, Gainesville, FL, 32611, USA 3Department of Operations Management & Operations Research, University of Groningen Nettelbosje 2, 9747 AE ...

Single Machine Scheduling with Rejection: Minimizing Total Weighted Completion Time and Rejection Cost

In this paper, the authors consider a single machine scheduling problem with rejection. In traditional research, it is assumed all jobs must be processed. However, in the real-world situation, certain jobs can be rejected. In this study, the jobs can be either accepted and scheduled or be rejected at the cost of a penalty. Two objective functions are considered simultaneously: (1) minimization ...

A New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm

This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...